Location:
Search - 8 queen
Search list
Description: 1）编程实现n皇后算法，要求求出8皇后问题的所有解。
2）编程实现0-1背包问题的最优解。测试数据采用贪心算法一章的实验数据。
3）用图形输出中间过程。
4）在程序中添加统计扩展节点数，估计算法的复杂性。
-1) programming to achieve the queen n algorithm, the problem of all solutions to the 8 queens.
2) programming to realize the optimal solution of 0-1 knapsack problem. Test data using the greedy algorithm of the experimental data.
3) in the process of the middle process of graphic output.
4) the complexity of the algorithm is added to the program.
Platform: |
Size: 10240 |
Author: 陈倩 |
Hits:
Description: 使用回溯法求8皇后或者N皇后，可以进行输入查看皇后位置是否放错，也可以求回溯法的N皇后球法与普通蛮力法的效率比，-8 N Queen Queen or seek to use backtracking, you can enter to see if the Queen' s position wrong, you can find the N Queens backtracking ball method and efficiency than ordinary brute force method,
Platform: |
Size: 2360320 |
Author: 杨朝静 |
Hits:
Description: 编程模拟洗牌和发牌过程。一副扑克有52张牌，分为4种花色（suit）：黑桃（Spades）、红桃（Hearts）、草花（Clubs）、方块（Diamonds）。每种花色又有13张牌面（face）：A，2，3，4，5，6，7，8，9，10，Jack，Queen，King。要求用结构体数组card表示52张牌，每张牌包括花色和牌面两个字符型数组类型的数据成员。
-the process of washing and giving poker cards
Platform: |
Size: 1024 |
Author: janewio |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。(The eight queen problem, an old and famous problem, is a typical case of backtracking algorithms. It is put forward the international chess Max Bethel in 1848: the queen placed eight in the 8 x 8 grid of the international chess, making it unable to attack each other, that any two queens are not in the same line, the same row or on the same diagonal, how many kinds of pendulum method.)
Platform: |
Size: 8569856 |
Author: 静守成雯
|
Hits:
Description: 在8*8的国际象棋棋盘上，安放8个皇后，要求没有一个皇后能够“吃掉”任何其它一个皇后，即任意两个皇后不能处于同一行，同一列或者同一条对角线上，求解有多少种摆法。
本实验拓展了N皇后问题，即皇后个数由用户输入(On the chess board of 8*8, 8 queens are placed, requiring that no queen can eat any other queen, that is, any two Queens can not be in the same row, the same column or the same diagonal line, and how many kinds of pendulum are solved.
This experiment extends the N queen problem, that is, the number of the queen is input from the user.)
Platform: |
Size: 15360 |
Author: babou
|
Hits:
Description: 国际象棋中皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将N个皇后放在一个国际象棋的棋盘上（有8 * 8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。我们现在扩展一下，对于某个满足要求的N皇后的摆放方法，定义一个皇后序列与之对应，即{(x1,y1),(x2,y2)…(xN,yN)}，其中(xi∈[1,N]，yi∈[1,N],N∈[4,16]),其中(xi,yi)为相应摆法中第i个皇后所处的坐标（行数和列数）。那么需要针对这个序列进行检测，检测序列给定的皇后们是否存在可以相互吃掉的情况。(In chess, the queen can eat other pieces on the horizontal, vertical and oblique lines. How to put N empress on a chess board (8 * 8 squares), so that none of them can be eaten. This is the famous eight queen problem. Let's expand now, and define a queen's sequence corresponding to the placement method of a N queen to meet the requirements, that is, {(x1, Y1), (X2, Y2). (xN, yN)}, where (Xi, [1, N], Yi, [1, N], N [4,16]), (Xi, Xi) is the coordinate (row number and column number) of the queen in the corresponding pendulum. Then we need to detect this sequence to detect whether the Queens given by the sequence can eat each other.)
Platform: |
Size: 5120 |
Author: youxiaoyu |
Hits:
«
1
2
...
16
17
18
19
20
21»